Search results

The study reported in this paper proposed the use of artificial neural networks (ANN) as viable alternative to regression for predicting the cost of building services elements at the early stage of design. The purpose of this paper is to develop, test and validate ANN models for predicting the costs of electrical services components.

The research is based on data mining of over 200 building projects in the office of a medium size electrical contractor. Of the over 200 projects examined, 71 usable data were found and used for the ANN modeling. Regression models were also explored using IBM Statistical Package for Social Sciences Statistics Software 21, for the purpose of comparison with the ANN models.

The findings show that the cost forecasting models based on ANN algorithm are more viable alternative to regression models for predicting the costs of light wiring, power wiring and cable pathways. The ANN prediction errors achieved are 6.4, 4.5 and 4.5 per cent for the three models developed whereas the regression models were insignificant. They did not fit any of the known regression distributions.

The validated ANN models were converted to a desktop application (user interface) package – “Intelligent Estimator.” The application is important because it can be used by construction professionals to reliably and quickly forecast the costs of power wiring, light wiring and cable pathways using building variables that are readily available or measurable during design stage, i.e. fully enclosed covered area, unenclosed covered area, internal perimeter length and number of floors.

Previous studies have concluded that the methods of estimating the budget for building structure and fabric work are inappropriate for use with mechanical and electrical services. Thus, this study is unique because it applied the ANN modeling technique, for the first time, to cost modeling of electrical services components for building using real world data. The analysis shows that ANN is a better alternative to regression models for predicting cost of services elements because the relationship between cost and the cost drivers are non-linear and distribution types are unknown.

Purpose: This paper examines beef consumption practices in two villages of Tamil Nadu, India. It inquires into how the upper castes create spatial boundaries to separate the inside from the outside in their consumption of beef.

Methodology: The research was carried out in two villages of Kariacheri and Pudupattinam located in the Kanchipuram district of Tamil Nadu, India. We conducted 70 in-depth interviews, and observed beef buying and consumption practices.

Findings: The research shows how the upper castes separate the inside from the outside and surreptitiously consume beef. Dalits or untouchables are unable to create such separations, and as a result are stigmatized and ostracized. Moreover, the distinction between the inside and the outside is not fixed but is in a state of transition.

Originality and value: This study offers insights into how stigma is defined by spatial boundaries. These insights help to understand purity, pollution, and stigma in consumption practices as ongoing processes that are often created to justify social divisions and discriminatory practices.

With the continuous increase of users, resources and tags, social tagging systems gradually present the characteristics of “big data” such as large number, fast growth, complexity and unreliable quality, which greatly increases the complexity of recommendation. The contradiction between the efficiency and effectiveness of recommendation service in social tagging is increasingly becoming prominent. The purpose of this study is to incorporate topic optimization into collaborative filtering to enhance both the effectiveness and the efficiency of personalized recommendations for social tagging.

Combining the idea of optimization before service, this paper presents an approach that incorporates topic optimization into collaborative recommendations for social tagging. In the proposed approach, the recommendation process is divided into two phases of offline topic optimization and online recommendation service to achieve high-quality and efficient personalized recommendation services. In the offline phase, the tags' topic model is constructed and then used to optimize the latent preference of users and the latent affiliation of resources on topics.

Experimental evaluation shows that the proposed approach improves both precision and recall of recommendations, as well as enhances the efficiency of online recommendations compared with the three baseline approaches. The proposed topic optimization–incorporated collaborative recommendation approach can achieve the improvement of both effectiveness and efficiency for the recommendation in social tagging.

With the support of the proposed approach, personalized recommendation in social tagging with high quality and efficiency can be achieved.

Trajectory tracking is a common problem in the field of mobile robots which has attracted a lot of attention in the past two decades. Therefore, besides the search for new controllers to achieve a better performance, improvement and optimization of existing control rules are necessary. Trajectory tracking control laws usually contain constant gains which affect greatly the robot’s performance.

In this paper, a method based on neural networks is introduced to automatically upgrade the gains of a well-known trajectory tracking controller of wheeled mobile robots. The suggested method speeds up the convergence rate of the main controller.

Simulations and experiments are performed to assess the ability of the suggested scheme. The obtained results show the effectiveness of the proposed method.

In this paper, a method based on neural networks is introduced to automatically upgrade the gains of a well-known trajectory tracking controller of wheeled mobile robots. The suggested method speeds up the convergence rate of the main controller.

Feature selection is an important step for data pre-processing specially in the case of high dimensional data set. Performance of the data model is reduced if the model is trained with high dimensional data set, and it results in poor classification accuracy. Therefore, before training the model an important step to apply is the feature selection on the dataset to improve the performance and classification accuracy.

A novel optimization approach that hybridizes binary particle swarm optimization (BPSO) and differential evolution (DE) for fine tuning of SVM classifier is presented. The name of the implemented classifier is given as DEPSOSVM.

This approach is evaluated using 20 UCI benchmark text data classification data set. Further, the performance of the proposed technique is also evaluated on UCI benchmark image data set of cancer images. From the results, it can be observed that the proposed DEPSOSVM techniques have significant improvement in performance over other algorithms in the literature for feature selection. The proposed technique shows better classification accuracy as well.

The proposed approach is different from the previous work, as in all the previous work DE/(rand/1) mutation strategy is used whereas in this study DE/(rand/2) is used and the mutation strategy with BPSO is updated. Another difference is on the crossover approach in our case as we have used a novel approach of comparing best particle with sigmoid function. The core contribution of this paper is to hybridize DE with BPSO combined with SVM classifier (DEPSOSVM) to handle the feature selection problems.

In recent years, the application of metaheuristics in training neural network models has gained significance due to the drawbacks of deterministic algorithms. This paper aims to propose the use of a recently developed “memory based hybrid dragonfly algorithm” (MHDA) for training multi-layer perceptron (MLP) model by finding the optimal set of weight and biases.

The efficiency of MHDA in training MLPs is evaluated by applying it to classification and approximation benchmark data sets. Performance comparison between MHDA and other training algorithms is carried out and the significance of results is proved by statistical methods. The computational complexity of MHDA trained MLP is estimated.

Simulation result shows that MHDA can effectively find the near optimum set of weight and biases at a higher convergence rate when compared to other training algorithms.

This paper presents MHDA as an alternative optimization algorithm for training MLP. MHDA can effectively optimize set of weight and biases and can be a potential trainer for MLPs.

This paper aims to present a summary of the green consumer behaviour (GCB) research conducted during the 2001–2021 period using the bibliometric analysis and to carry out a thematic and content analysis on the three clusters which comprise 57 articles resulting from the co-citation analysis and identify the significant green purchasing factors.

The three-pronged methodology applied to this research analysis includes performance analysis of the literature using biblioshiny and R Studio; network mapping analysis using VOSviewer and Gephi; thematic analysis using word clouds generated with R Software and content analysis of each paper with the aid of within and between-study analyses.

Cluster one acted as a base for the theoretical foundations of GCB which aids in understanding the basic concepts of green marketing, its evolution and the methodologies, whereas cluster two determined the predictors of everyday green behaviour, which helps in gaining knowledge about the everyday sustainable activities the consumers indulge and the factors motivating to do so. Cluster three mainly focused on the psycho-socio demographic determinants of GCB, which assists in segmentation and predicting the purchase behaviour of the various consumer segments.

The significant variables and major gaps in each of the clusters were identified and authors have drawn the implications for future researchers and marketing managers.

The purpose of this paper is to propose a multi-objective differential evolution algorithm named as MOMR-DE to resolve multicast routing problem. In mobile ad hoc network (MANET), multicast routing is a non-deterministic polynomial -complete problem that deals with the various objectives and constraints. Quality of service (QoS) in the multicast routing problem mainly depends on cost, delay, jitter and bandwidth. So the cost, delay, jitter and bandwidth are always considered as multi-objective for designing multicast routing protocols. However, mobile node battery energy is finite and the network lifetime depends on node battery energy. If the battery power consumption is high in any one of the nodes, the chances of network’s life reduction due to path breaks are also more. On the other hand, node’s battery energy had to be consumed to guarantee high-level QoS in multicast routing to transmit correct data anywhere and at any time. Hence, the network lifetime should be considered as one objective of the multi-objective in the multicast routing problem.

Recently, many metaheuristic algorithms formulate the multicast routing problem as a single-objective problem, although it obviously is a multi-objective optimization problem. In the MOMR-DE, the network lifetime, cost, delay, jitter and bandwidth are considered as five objectives. Furthermore, three QoS constraints which are maximum allowed delay, maximum allowed jitter and minimum requested bandwidth are included. In addition, we modify the crossover and mutation operators to build the shortest-path multicast tree to maximize network lifetime and bandwidth, minimize cost, delay and jitter.

Two sets of experiments are conducted and compared with other algorithms for these problems. The simulation results show that our proposed method is capable of achieving faster convergence and is more preferable for multicast routing in MANET.

In MANET, most metaheuristic algorithms formulate the multicast routing problem as a single-objective problem. However, this paper proposes a multi-objective differential evolution algorithm to resolve multicast routing problem, and the proposed algorithm is capable of achieving faster convergence and more preferable for multicast routing.